General logical databases and programs: Default logic semantics and stratification
نویسندگان
چکیده
منابع مشابه
A Logical Semantics for Description Logic Programs
We present a new semantics for Description Logic programs [1] (dlprograms) that combine reasoning about ontologies in description logics with non-monotonic rules interpreted under answer set semantics. Our semantics is equivalent to that of [1], but is more logical in style, being based on the logic QHT of quantified here-and-there that provides a foundation for ordinary logic programs under an...
متن کاملThe Alternating Semantics for Default Theories and Logic Programs
In this paper we propose a semantics for default theories, based on van Gelder's alternating xpoint theory. The distinct feature of this semantics is its preservation of Reiter's semantics when a default theory is not considered \problematic" under Reiter's semantics. Diierences arise only when a default theory has no extensions, or has only \biased extensions" under Reiter's semantics. This fe...
متن کاملSemantics for Disjunctive Logic Programs with Explicit and Default Negation
The use of explicit negation enhances the expressive power of logic programs by providing a natural and unambiguous way to assert negated information about the domain being represented. We study the semantics of disjunctive programs that contain both explicit negation and negation-by-default, called extended disjunctive logic programs. General techniques are described for extending model, xpoin...
متن کاملA Logical Foundation for Logic Programming II: Semantics of General Logic Programs
We suggested in 12] a general logical formalism for Logic Programming based on a four-valued inference. In this paper we give a uniform representation of various semantics for logic programs based on this formalism. The main conclusion from this representation is that the distinction between these semantics can be largely attributed to the diierence in their underlying (monotonic) logical syste...
متن کاملMinimal founded semantics for disjunctive logic programs and deductive databases
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90073-b